Metamathematical Results on Formally Undecidable Propositions: Completeness vs. Incompleteness 1. Life and Work
نویسنده
چکیده
1. Life and work Kurt Gödel was a solitary genius, whose work influenced all the subsequent developments in mathematics and logic. The striking fundamental results in the decade 1929-1939 that made Gödel famous are the completeness of the first-order predicate logic proof calculus, the incompleteness of axiomatic theories containing arithmetic, and the consistency of the axiom of choice and the continuum hypothesis with the other axioms of set theory. During the same decade Gödel made other contributions to logic, including work on intuitionism and computability, and later, under the influence of his friendship with Einstein, made a fundamental contribution to the theory of space-time. In this article I am going to summarize the most outstanding results on incompleteness and undecidability that changed the fundamental views of modern mathematics.
منابع مشابه
Reflections on Concrete Incompleteness
How do we prove true, but unprovable propositions? Gödel produced a statement whose undecidability derives from its “ad hoc” construction. Concrete or mathematical incompleteness results, instead, are interesting unprovable statements of Formal Arithmetic. We point out where exactly lays the unprovability along the ordinary mathematical proofs of two (very) interesting formally unprovable propo...
متن کاملGödel : The Completeness and Incompleteness The - orems Kurt
Gödel: The Completeness and Incompleteness Theorems Kurt Gödel (1906–1978) 1930-The completeness of first-order logic 1931-On formally undecidable statements of Principia Mathematica and related systems I Gödel's first paper proves the completeness of the axioms and rules of first-order logic, essentially as given in Hilbert and Ackermann. There has been much discussion as to why Skolem (or Her...
متن کاملOn Gödel incompleteness and finite combinatorics
Giidel’s paper on formally undecidable propositions [3] raised the possibility that linite combinatorial theorems could be discovered which are independent of powerful axiomatic systems such as first-order Peano Arithmetic. An important advance was made by J. Paris in the late 1970’s; building on joint work with L. Kirby, he used model-theoretic techniques to investigate arithmetic incompletene...
متن کاملObservations concerning Gödel ’
This article demonstrates the invalidity of the so-called Gödel’s first incompleteness theorem, showing that propositions (15) and (16), derived from the definition 8.1 in Gödel’s 1931 article, are false. Introduction. Developed as a consequence of the crisis of the foundation of mathematics due to the discovery of the antinomies, Hilbert’s formalism planned as criterions of adequacy for the ax...
متن کاملGodel's Incompleteness Phenomenon - Computationally
We argue that Gödel’s completeness theorem is equivalent to completability of consistent theories, and Gödel’s incompleteness theorem is equivalent to the fact that this completion is not constructive, in the sense that there are some consistent and recursively enumerable theories which cannot be extended to any complete and consistent and recursively enumerable theory. Though any consistent an...
متن کامل